SOLUTION OF CAPACITATED VEHICLE ROUTING PROBLEM FOR A FOOD DELIVERY COMPANY WITH HEURISTIC METHODS

A food delivery company operates in Balıkesir performs to the distribution for products of a certain brand from central warehouse customers located districts Altıeylül and Karesi by using two vehicles with high capacity. The visits on routes meet their daily demands is able all at end day. In this study, company's was considered as Vehicle Routing Problem, it aimed reconstruct help various algorithms provide cost savings terms distance traveled. order solve problem, first all, an appropriate capacity assumption made considering demand amounts customers. Under assumption, new customer groups be visited periods were created, then obtained relevant groups. process, problem designed Capacity Constrained results Fisher Jaikumar's Algorithm Clarke Wright's Savings evaluated. When are compared current route status company, has been determined that possible achieve rate improvement algorithms.